Complete split graph determined by its (signless) Laplacian spectrum
نویسندگان
چکیده
منابع مشابه
Graphs determined by their (signless) Laplacian spectra
Let S(n, c) = K1∨(cK2∪(n−2c−1)K1), where n ≥ 2c+1 and c ≥ 0. In this paper, S(n, c) and its complement are shown to be determined by their Laplacian spectra, respectively. Moreover, we also prove that S(n, c) and its complement are determined by their signless Laplacian spectra, respectively.
متن کاملSome Graphs Determined by Their (signless) Laplacian Spectra
Let Wn = K1 ∨ Cn−1 be the wheel graph on n vertices, and let S(n, c, k) be the graph on n vertices obtained by attaching n− 2c− 2k − 1 pendant edges together with k hanging paths of length two at vertex v0, where v0 is the unique common vertex of c triangles. In this paper we show that S(n, c, k) (c > 1, k > 1) and Wn are determined by their signless Laplacian spectra, respectively. Moreover, w...
متن کاملEla Graphs Determined by Their (signless) Laplacian Spectra
Let S(n, c) = K1∨(cK2∪(n−2c−1)K1), where n ≥ 2c+1 and c ≥ 0. In this paper, S(n, c) and its complement are shown to be determined by their Laplacian spectra, respectively. Moreover, we also prove that S(n, c) and its complement are determined by their signless Laplacian spectra, respectively.
متن کاملThe Lollipop Graph is Determined by its Spectrum
An even (resp. odd) lollipop is the coalescence of a cycle of even (resp. odd) length and a path with pendant vertex as distinguished vertex. It is known that the odd lollipop is determined by its spectrum and the question is asked by W. Haemers, X. Liu and Y. Zhang for the even lollipop. We revisit the proof for odd lollipop, generalize it for even lollipop and therefore answer the question. O...
متن کاملTHE SPECTRAL DETERMINATION OF THE MULTICONE GRAPHS Kw ▽ C WITH RESPECT TO THEIR SIGNLESS LAPLACIAN SPECTRA
The main aim of this study is to characterize new classes of multicone graphs which are determined by their signless Laplacian spectra. A multicone graph is defined to be the join of a clique and a regular graph. Let C and K w denote the Clebsch graph and a complete graph on w vertices, respectively. In this paper, we show that the multicone graphs K w ▽C are determined by their signless ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2016
ISSN: 0166-218X
DOI: 10.1016/j.dam.2016.01.003